- deductive algorithm
- дедуктивний алгоритм (моделювання справних і несправних ВІС)
English-Ukrainian dictionary of microelectronics. 2013.
deductive algorithm
Смотреть что такое "deductive algorithm" в других словарях:
Algorithm — Flow chart of an algorithm (Euclid s algorithm) for calculating the greatest common divisor (g.c.d.) of two numbers a and b in locations named A and B. The algorithm proceeds by successive subtractions in two loops: IF the test B ≤ A yields yes… … Wikipedia
Hindley–Milner — In type theory, Hindley–Milner (HM) (also known as Damas–Milner or Damas–Hindley–Milner) is a classical type inference method with parametric polymorphism for the lambda calculus, first described by J. Roger Hindley[1] and later rediscovered by… … Wikipedia
History of mathematics — A proof from Euclid s Elements, widely considered the most influential textbook of all time.[1] … Wikipedia
Function (mathematics) — f(x) redirects here. For the band, see f(x) (band). Graph of example function, In mathematics, a function associates one quantity, the a … Wikipedia
Undecidable problem — In computability theory and computational complexity theory, an undecidable problem is a decision problem for which it is impossible to construct an algorithm that leads to a yes or no answer the problem is not decidable.A decision problem is any … Wikipedia
thought — thought1 /thawt/, n. 1. the product of mental activity; that which one thinks: a body of thought. 2. a single act or product of thinking; idea or notion: to collect one s thoughts. 3. the act or process of thinking; mental activity: Thought as… … Universalium
Gödel's incompleteness theorems — In mathematical logic, Gödel s incompleteness theorems, proved by Kurt Gödel in 1931, are two theorems stating inherent limitations of all but the most trivial formal systems for arithmetic of mathematical interest. The theorems are of… … Wikipedia
Richard Waldinger — Richard J. Waldinger is a computer science researcher at SRI Artificial Intelligence Laboratory (where he has worked since 1969) whose interests focus on the application of automated deductive reasoning to problems in software engineering and… … Wikipedia
Computable function — Total recursive function redirects here. For other uses of the term recursive function , see Recursive function (disambiguation). Computable functions are the basic objects of study in computability theory. Computable functions are the formalized … Wikipedia
Boolean satisfiability problem — For the concept in mathematical logic, see Satisfiability. 3SAT redirects here. For the Central European television network, see 3sat. In computer science, satisfiability (often written in all capitals or abbreviated SAT) is the problem of… … Wikipedia
Artificial intelligence — AI redirects here. For other uses, see Ai. For other uses, see Artificial intelligence (disambiguation). TOPIO, a humanoid robot, played table tennis at Tokyo International Robot Exhibition (IREX) 2009.[1] Artificial intelligence ( … Wikipedia
